The Univalence Axiom in posetal model categories
نویسندگان
چکیده
In this note we interpret Voevodsky’s Univalence Axiom in the language of (abstract) model categories. We then show that any posetal locally Cartesian closed model category Qt in which the mapping Hom(w)(Z × B,C) : Qt −→ Sets is functorial in Z and represented in Qt satisfies our homotopy version of the Univalence Axiom, albeit in a rather trivial way. This work was motivated by a question reported in [Gar11], asking for a model of the Univalence Axiom not equivalent to the standard one.
منابع مشابه
W-types in homotopy type theory
We will give a detailed account of why the simplicial sets model of the univalence axiom due to Voevodsky also models W-types. In addition, we will discuss W-types in categories of simplicial presheaves and an application to models of set theory.
متن کاملDecomposing the Univalence Axiom
This paper investigates the univalence axiom in intensional Martin-Löf type theory. In particular, it looks at how univalence can be derived from simpler axioms. We first present some existing work, collected together from various published and unpublished sources; we then we present a new decomposition of the univalence axiom into simpler axioms. We argue that these axioms are easier to verify...
متن کاملUnivalence as a Principle of Logic
It is sometimes convenient or useful in mathematics to treat isomorphic structures as the same. The recently proposed Univalence Axiom for the foundations of mathematics elevates this idea to a foundational principle in the setting of Homotopy Type Theory. It states, roughly, that isomorphic structures can be identified. We explore the motivations and consequences, both mathematical and philoso...
متن کاملHomotopy type theory and Voevodsky's univalent foundations
Recent discoveries have been made connecting abstract homotopy theory and the field of type theory from logic and theoretical computer science. This has given rise to a new field, which has been christened “homotopy type theory”. In this direction, Vladimir Voevodsky observed that it is possible to model type theory using simplicial sets and that this model satisfies an additional property, cal...
متن کاملMultisets in Type Theory
A multiset consists of elements, but the notion of a multiset is distinguished from that of a set by carrying information of how many times each element occurs in a given multiset. In this work we will investigate the notion of iterative multisets, where multisets are iteratively built up from other multisets, in the context Martin-Löf Type Theory, in the presence of Voevodsky’s Univalence Axio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Comput.
دوره 25 شماره
صفحات -
تاریخ انتشار 2015